Adaptive Scheduling of Data Paths using Uppaal Tiga
نویسندگان
چکیده
منابع مشابه
Adaptive Scheduling of Data Paths using Uppaal Tiga
Scheduling concerns the allocation of resources to activities over time in order to achieve some goals. Scheduling problems occur in many different domains and a vast amount of research has been carried out in this area. However, in the research literature scheduling is usually seen as a function of known, perfect inputs: the set of jobs, their arrival times, the capacities of machines, the dur...
متن کاملUPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototype presented at that time has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of Uppaal-4.0. The new tool can output stra...
متن کاملGuided Controller Synthesis for Climate Controller Using Uppaal Tiga
We present a complete tool chain for automatic controller synthesis using Uppaal Tiga and Simulink. The tool chain is explored using an industrial case study for climate control in a pig stable. The problem is modeled as a game, and we useUppaal Tiga to automatically synthesize safe strategies that are transformed for input to Simulink, which is used to run simulations on the controller and gen...
متن کاملUPPAAL - Tiga : Time for Playing Games ! ( Tool Paper )
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototype presented at that time has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of Uppaal-4.0. The new tool can output stra...
متن کاملHierarchical Scheduling Framework Based on Compositional Analysis Using Uppaal
This paper introduces a reconfigurable compositional scheduling framework, in which the hierarchical structure, the scheduling policies, the concrete task behavior and the shared resources can all be reconfigured. The behavior of each periodic preemptive task is given as a list of timed actions, which are some of the inputs for the parameterized timed automata that make up the framework. Compon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2009
ISSN: 2075-2180
DOI: 10.4204/eptcs.13.1